On the Formulation of Closest-Point Projection Algorithms in Elastoplasticity
نویسنده
چکیده
We present in this paper the characterization of the variational structure behind the discrete equations defining the closest-point projection approximation in elastoplasticity. Rate-independent and viscoplastic formulations are considered in the infinitesimal and the finite deformation range, the later in the context of isotropic finite strain multiplicative plasticity. Primal variational principles in terms of the stresses and stress-like hardening variables are presented first, followed by the formulation of dual principles incorporating explicitly the plastic multiplier. Augmented Lagrangian extensions are also presented allowing a complete regularization of the problem in the constrained rate-independent limit. The variational structure identified in this paper leads to the proper framework for the development of new improved numerical algorithms for the integration of the local constitutive equations of plasticity as it is undertaken in Part II of this work.
منابع مشابه
On the Formulation of Closest-Point Projection Algorithms in Elastoplasticity. Part II: Globally Convergent Schemes
This paper presents the formulation of numerical algorithms for the solution of the closest-point projection equations that appear in typical implementations of return mapping algorithms in elastoplasticity. The main motivation behind this work is to avoid the poor global convergence properties of a straight application of a Newton scheme in the solution of these equations, the socalled Newton–...
متن کاملComputational Aspects of Incrementally Objective Algorithms for Large Deformation Plasticity
A methodology for computationally efficient formulation of the tangent stiffness matrix consistent with incrementally objective algorithms for integrating finite deformation kinematics and with closest point projection algorithms for integrating material response is developed in the context of finite deformation plasticity. Numerical experiments illustrate an excellent performance of the propos...
متن کاملModelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملThe overall efficiency and projection point in network DEA
Data Envelopment Analysis (DEA) is one of the best methods for measuring the efficiency and productivity of Decision Making Units (DMU). Evaluating the efficiency of DMUs which have two or several stages by using the conventional DEA models, is equal to consider them as black box. This method, omits the effect of intermediate measure on efficiency. Therefore, just the first network inputs and t...
متن کاملVariational Formulations and Functional Approximation Algorithms in Stochastic Plasticity of Materials
Within the framework of elastoplastic analysis the focus is set on the rate-independent evolutionary problem with general hardening whose material characteristics are assumed to be uncertain. These processes are described via a stochastic convex energy function and evolution equations for internal variables. Computationally such posed problem reduces to the stochastic minimisation of smooth con...
متن کامل